From which world is your graph

نویسندگان

  • Cheng Li
  • Felix Ming Fai Wong
  • Zhenming Liu
  • Varun Kanade
چکیده

Discovering statistical structure from links is a fundamental problem in the analysis of social networks. Choosing a misspecified model, or equivalently, an incorrect inference algorithm will result in an invalid analysis or even falsely uncover patterns that are in fact artifacts of the model. This work focuses on unifying two of the most widely used link-formation models: the stochastic blockmodel (SBM) and the small world (or latent space) model (SWM). Integrating techniques from kernel learning, spectral graph theory, and nonlinear dimensionality reduction, we develop the first statistically sound polynomialtime algorithm to discover latent patterns in sparse graphs for both models. When the network comes from an SBM, the algorithm outputs a block structure. When it is from an SWM, the algorithm outputs estimates of each node’s latent position.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

مدیر موفق کیست؟

Who is a really successful manager? A manager who spends less money, or the one who earns more? A manager who can survive for a longer period of time, or an administrator who expands his organization, and opens up new branches? Which one is the most successful? The article tries to answer these questions and provides, some simple guidlines for the managers in every domain of management who wan...

متن کامل

نگاهی دیگر به بیتی از مثنوی

Some texts, especially mystical and literary, are so intricate and labyrinthine that can be interpreted differently. These various interpretations sometimes result from the interior aspect of the texts, based on semantical understanding, and sometimes arise from their exterior aspect, based on different ways of reading the texts. Accordingly, while in another article along with other interprete...

متن کامل

Solving a nurse rostering problem considering nurses preferences by graph theory approach

Nurse Rostering Problem (NRP) or the Nurse Scheduling Problem (NSP) is a complex scheduling problem that affects hospital personnel on a daily basis all over the world and is known to be NP-hard.The problem is to decide which members of a team of nurses should be on duty at any time, during a rostering period of, typically, one month.It is very important to efficiently utilize time and effort, ...

متن کامل

Elements of Feminine Writing in Sepedeh Shamlu’s Novel Sorkhi-e-to az man (“Your Redness Is Mine”)

Feministic criticism concerns the function of specific feminine cultural and ideological constituents in literal works. In its approach to narrative this kind of criticism follows two methods. First, the attributes of women and their role and personality in course of the story, and second a critique of women presented which studies female authors. Sorkhi-e-to az man by Sepedeh Shamlu is one the...

متن کامل

Graph-based Knowledge Representation - Computational Foundations of Conceptual Graphs

Bring home now the book enPDFd graph based knowledge representation computational foundations of conceptual graphs to be your sources when going to read. It can be your new collection to not only display in your racks but also be the one that can help you fining the best sources. As in common, book is the window to get in the world and you can open the world easily. These wise words are really ...

متن کامل

Sampling from social networks’s graph based on topological properties and bee colony algorithm

In recent years, the sampling problem in massive graphs of social networks has attracted much attention for fast analyzing a small and good sample instead of a huge network. Many algorithms have been proposed for sampling of social network’ graph. The purpose of these algorithms is to create a sample that is approximately similar to the original network’s graph in terms of properties such as de...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017